Constraint learning for control tasks with limited duration barrier functions

نویسندگان

چکیده

When deploying autonomous agents in unstructured environments over sustained periods of time, adaptability and robustness oftentimes outweigh optimality as a primary consideration. In other words, safety survivability constraints play key role this paper, we present novel, constraint-learning framework for control tasks built on the idea constraints-driven control. However, since policies that keep dynamical agent within state infinite horizons are not always available, work instead considers can be satisfied some finite time horizon T > 0, which refer to limited-duration safety. Consequently, value function learning used tool help us find safe policies. We show that, applications, existence is actually sufficient long-duration autonomy. This illustrated swarm simulated robots tasked with covering given area, but sporadically need abandon task charge batteries. how battery-charging behavior naturally emerges result constraints. Additionally, using cart-pole simulation environment, policy efficiently transferred from source task, balancing pole, target moving cart one direction without letting pole fall down.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-Driven Active Learning Across Tasks

Consider a set of T tasks, each with a response variable Yi, i = 1, 2, . . . , T . Each sample in our training set x ∈ U is associated with these T labels (labels are not necessarily binary). For each sample, we might know a few (or none) of its T labels. We use UL(x) to denote the set of unknown labels on a sample x: UL(x) = {Yi : Yi is unknown for sample x}. Given labeled examples, we can lea...

متن کامل

On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

متن کامل

Robustness of Control Barrier Functions for Safety Critical Control

Barrier functions (also called certificates) have been an important tool for the verification of hybrid systems, and have also played important roles in optimization and multiobjective control. The extension of a barrier function to a controlled system results in a control barrier function. This can be thought of as being analogous to how Sontag extended Lyapunov functions to control Lypaunov f...

متن کامل

Learning Model Predictive Control for Iterative Tasks

A Learning Model Predictive Controller (LMPC) for iterative tasks is presented. The controller is referencefree and is able to improve its performance by learning from previous iterations. A safe set and a terminal cost function are used in order to guarantee recursive feasibility and nonincreasing performance at each iteration. The paper presents the control design approach, and shows how to r...

متن کامل

Local Self-concordance of Barrier Functions Based on Kernel-functions

 Many efficient interior-point methods (IPMs) are based on the use of a self-concordant barrier function for the domain of the problem that has to be solved. Recently, a wide class of new barrier functions has been introduced in which the functions are not self-concordant, but despite this fact give rise to efficient IPMs. Here, we introduce the notion of locally self-concordant barrier functio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2021

ISSN: ['1873-2836', '0005-1098']

DOI: https://doi.org/10.1016/j.automatica.2021.109504